skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Luo, Haoran"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Discrete Mathematics)
    Free, publicly-accessible full text available August 1, 2026
  2. ; ; (, Random Structures & Algorithms)
    ABSTRACT For graphs and , let be the minimum possible size of a maximum ‐free induced subgraph in an ‐vertex ‐free graph. This notion generalizes the Ramsey function and the Erdős–Rogers function. Establishing a container lemma for the ‐free subgraphs, we give a general upper bound on , assuming the existence of certain locally dense ‐free graphs. In particular, we prove that for every graph with , where , we have For the cases where is a complete multipartite graph, letting , we prove that We also make an observation which improves the bounds of by a polylogarithmic factor. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026
  3. ; (, Combinatorica)
    Full Text Available 
  4. ; ; ; ; ; ; (, Combinatorica)
    Full Text Available 
  5. ; ; (, Random Structures & Algorithms)
    Full Text Available